Universal retrieval trees
نویسندگان
چکیده
منابع مشابه
Universal maps on trees
A map f : R ! S of continua R and S is called a universal map from R to S if for any map g : R ! S, f(x) = g(x) for some point x 2 R. When R and S are trees, we characterize universal maps by reducing to the case of light minimal universal maps. The characterization uses the notions of combinatorial map and folded subedge of R. MOS Subject Classi cation Primary: 54H25 Secondary: 54F20
متن کاملUniversal Mobile Information Retrieval
The shift in human computer interaction from desktop computing to mobile interaction highly influences the needs for new designed interfaces. In this paper, we address the issue of searching for information on mobile devices, an area also known as Mobile Information Retrieval. In particular, we propose to summarize as much as possible the information retrieved by any search engine to allow univ...
متن کاملUniversal Spaces for R-trees
R-trees arise naturally in the study of groups of isometries of hyperbolic space. An R-tree is a uniquely arcwise connected metric space in which each arc is isometric to a subarc of the reals. It follows that an R-tree is locally arcwise connected, contractible, and one-dimensional. Unique and local arcwise connectivity characterize R-trees among metric spaces. A universal R-tree would be of i...
متن کاملUniversal Succinct Representations of Trees?
We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T , our representations support the following operations in O(1) time: (i) BP-substring(i, b), which reports the substring of length b bits (b is at most the wordsize) beginning at position i of the balanced parenthesis representation of T , (ii) DFUDS-substring(i, b), which...
متن کاملError-Tolerant Retrieval of Trees
We present an efficient algorithm for retrieving from a database of trees, all trees that differ from a given query tree by a small number additional or missing leaves, or leaf label changes. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. For lar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1985
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90031-9